Refined sign-balance on 321-avoiding permutations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refined sign-balance on 321-avoiding permutations

The number of even 321-avoiding permutations of length n is equal to the number of odd ones if n is even, and exceeds it by the n−1 2 th Catalan number otherwise. We present an involution that proves a refinement of this sign-balance property respecting the length of the longest increasing subsequence of the permutation. In addition, this yields a combinatorial proof of a recent analogous resul...

متن کامل

Equidistribution and Sign-Balance on 321-Avoiding Permutations

Let Tn be the set of 321-avoiding permutations of order n. Two properties of Tn are proved: (1) The last descent and last index minus one statistics are equidistributed over Tn, and also over subsets of permutations whose inverse has an (almost) prescribed descent set. An analogous result holds for Dyck paths. (2) The sign-and-last-descent enumerators for T2n and T2n+1 are essentially equal to ...

متن کامل

Sign-balance identities of Adin-Roichman type on 321-avoiding alternating permutations

Adin and Roichman proved a set of refined sign-balance identities on 321-avoiding permutations respecting the last descent of the permutations, which we call the identities of Adin–Roichman type. In thiswork,we construct a new involution onplane trees that proves refined sign-balance properties on 321-avoiding alternating permutations respecting the first and last entries of the permutations re...

متن کامل

Inversion Formulae on Permutations Avoiding 321

We will study the inversion statistic of 321-avoiding permutations, and obtain that the number of 321-avoiding permutations on [n] with m inversions is given by

متن کامل

Equidistribution and Sign-balance on 132-avoiding Permutations

Let Rn be the set of all permutations of length n which avoid 132. In this paper we study the statistics last descent (“ldes”), first descent (“fdes”), last rise (“lris”), and first rise (“fris”) on the set Rn. In particular, we prove that the bistatistic (“fris”,“lris”) on the set of all permutations Rn\{n . . . 21} and the bistatistic (“n− ldes”,“n− fdes”) on the set of all permutations of Rn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2005

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2004.06.009